/**
 * ============================================================================
 *
 * Copyright (C) 2018, Hisilicon Technologies Co., Ltd. All Rights Reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *   1 Redistributions of source code must retain the above copyright notice,
 *     this list of conditions and the following disclaimer.
 *
 *   2 Redistributions in binary form must reproduce the above copyright notice,
 *     this list of conditions and the following disclaimer in the documentation
 *     and/or other materials provided with the distribution.
 *
 *   3 Neither the names of the copyright holders nor the names of the
 *   contributors may be used to endorse or promote products derived from this
 *   software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 * ============================================================================
 */

#ifndef ASCENDDK_ASCEND_EZDVPP_CIRCLE_QUEUE_H_
#define ASCENDDK_ASCEND_EZDVPP_CIRCLE_QUEUE_H_

#include <mutex>
#include <unistd.h>


template <class T, int queue_size>
class CircleQueue
{
private:
	uint32_t size;
	uint32_t front;
	uint32_t rear;
	T*  data;
public:
	CircleQueue():front(0),	rear(0)
	{
		size = queue_size;
        data = new T[queue_size];
	}

	~CircleQueue()
	{
		delete[] data;
	}

	bool IsEmpty()
	{
		return front == rear;
	}

	bool IsFull()
	{
		return front == (rear + 1) % size;
	}

	int32_t Push(T ele)
	{
		if (IsFull())
		{
			return -1;
		}
		data[rear] = ele;
		rear = (rear + 1) % size;
		return 0;
	}

	T Pop()
	{
		T tmp = data[front];
		front = (front + 1) % size;
		return tmp;
	}
};


#endif